Recursion and Effectivity in the Decomposability Conjecture
نویسندگان
چکیده
Using ideas and results from recursion theory and effective descriptive set theory we provide a partial answer to the Decomposabilty Conjecture in Polish spaces of small inductive dimension. The latter extends earlier work of Motto Ros and Pawlikowski-Sabok. We also state a conjecture, which would allow our arguments to be carried out in all Polish spaces, and we give the analogous results in the transfinite case of the problem. Finally we present an approach to the later, where we utilize the technique of turning Borel-measurable functions into continuous ones.
منابع مشابه
Turing Degrees in Polish Spaces and Decomposability of Borel Functions
In this article we give a partial answer to an important open problem in descriptive set theory, the Decomposability Conjecture on Borel functions from an analytic subset of a Polish space into a separable metrizable space. Our techniques employ deep results from effective descriptive set theory and recursion theory. In fact it is essential to prove that several prominent results in recursion t...
متن کاملEssential normality and the decomposability of algebraic varieties
We consider the Arveson–Douglas conjecture on the essential normality of homogeneous submodules corresponding to algebraic subvarieties of the unit ball. We prove that the property of essential normality is preserved by isomorphisms between varieties, and we establish a similar result for maps between varieties that are not necessarily invertible. We also relate the decomposability of an algebr...
متن کاملOn Pseudo-Effectivity of the Second Chern Classes for Terminal Threefolds
We give a reduction of the conjecture that for terminal projective threefolds whose anticanonical divisors are nef, the second Chern classes are pseudo-effective. On the other hand, some effective nonvanishing results are obtained as applications of the pseudo-effectivity of the second Chern classes.
متن کاملFrankl's Conjecture for a subclass of semimodular lattices
In this paper, we prove Frankl's Conjecture for an upper semimodular lattice $L$ such that $|J(L)setminus A(L)| leq 3$, where $J(L)$ and $A(L)$ are the set of join-irreducible elements and the set of atoms respectively. It is known that the class of planar lattices is contained in the class of dismantlable lattices and the class of dismantlable lattices is contained in the class of lattices ha...
متن کاملObstructions to Weak Decomposability for Simplicial Polytopes
Provan and Billera introduced notions of (weak) decomposability of simplicial complexes as a means of attempting to prove polynomial upper bounds on the diameter of the facet-ridge graph of a simplicial polytope. Recently, De Loera and Klee provided the first examples of simplicial polytopes that are not weakly vertex-decomposable. These polytopes are polar to certain simple transportation poly...
متن کامل